Highly arc transitive digraphs: reachability, topological groups
نویسندگان
چکیده
Let D be a locally finite, connected, 1-arc transitive digraph. It is shown that the reachability relation is not universal in D provided that the stabilizer of an edge satisfies certain conditions which seem to be typical for highly arc transitive digraphs. As an implication, the reachability relation cannot be universal in highly arc transitive digraphs with prime inor out-degree. Two different aspects of the connection between highly arc transitive digraphs and the theory of totally disconnected locally compact groups are also considered. © 2003 Elsevier Ltd. All rights reserved.
منابع مشابه
Highly arc-transitive digraphs - Structure and counterexamples
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each ‘building block’ is a finite bipartite digrap...
متن کاملHighly arc-transitive digraphs – counterexamples and structure∗
We resolve two problems of [Cameron, Praeger, and Wormald – Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each ‘building block’ is a finite bipartite graph that is...
متن کاملCrown-free highly arc-transitive digraphs
We construct a family of infinite, non-locally finite highly arc-transitive digraphs which do not have universal reachability relation and which omit special digraphs called ‘crowns’. Moreover, there is no homomorphism from any of our digraphs onto Z. The methods are adapted from [5] and [6].
متن کاملSome constructions of highly arc-transitive digraphs
We construct infinite highly arc-transitive digraphs with finite out-valency and whose sets of descendants are digraphs which have a homomorphism onto a directed (rooted) tree. Some of these constructions are based on [4] and [5], and are shown to have universal reachability
متن کاملHighly Arc-Transitive Digraphs With No Homomorphism Onto Z
In an in nite digraph D an edge e is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e Reachability is an equivalence relation and if D is arc transitive then this relation is either universal or all of its equiv alence classes induce isomorphic bipartite digraphs In Question Cameron Praeger and Wormald asked if there exist highly arc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 26 شماره
صفحات -
تاریخ انتشار 2005